Making Bidirected Graphs Strongly Connected
نویسندگان
چکیده
منابع مشابه
Making Bidirected Graphs Strongly Connected
We consider problems to make a given bidirected graph strongly connected with minimum cardinality of additional signs or additional arcs. For the former problem, we show the minimum number of additional signs and give a linear-time algorithm for finding an optimal solution. For the latter problem, we give a linear-time algorithm for finding a feasible solution whose size is equal to the obvious...
متن کاملOn strongly connected orientations of graphs
We consider finite, loopless graphs or digraphs, without multiple edges or arcs (with no pairs of opposite arcs). Let G = (V,E) be a graph. A digraph D = (V,A) is an orientation of G if A is created from E by replacing every edge of E by an arc in one direction. Let nd denote the number of vertices with the degree d in G. By the degree pair of a vertex v ∈ V in D the ordered pair [outdegree(v),...
متن کاملFinding strongly connected components in distributed graphs
The traditional, serial, algorithm for finding the strongly connected components in a graph is based on depth first search and has complexity which is linear in the size of the graph. Depth first search is difficult to parallelize, which creates a need for a different parallel algorithm for this problem. We describe the implementation of a recently proposed parallel algorithm that finds strongl...
متن کاملFlipping in Acyclic and Strongly Connected Graphs
A flippable edge in an acyclic digraph is an edge whose reorientation leaves the graph acyclic. We characterize the spanning trees T of an undirected graph G such that there exists an acyclic orientation of G whose set of flippable edges is T . In particular for every edge e ∈ E(G) we give a linear algorithm returning an acyclic orientation and a spanning tree T containing e such that T is the ...
متن کاملStrongly 2-connected orientations of graphs
We prove that a graph admits a strongly 2-connected orientation if and only if it is 4-edge-connected, and every vertex-deleted subgraph is 2-edge-connected. In particular, every 4-connected graph has such an orientation while no cubic 3-connected graph has such an orientation.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Algorithmica
سال: 2019
ISSN: 0178-4617,1432-0541
DOI: 10.1007/s00453-019-00613-5